Derandomized Squaring of Graphs
نویسندگان
چکیده
We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squaring the graph does, yet only increases the degree of the graph by a constant factor, instead of squaring the degree. One application of this product is an alternative proof of Reingold’s recent breakthrough result that S-T Connectivity in Undirected Graphs can be solved in deterministic logspace.
منابع مشابه
Foliar application of nano-chelate and non-nanochelate of zinc on plant resistance physiological processes in cotton (Gossipium hirsutum L.). Mohammadali Rezaei* and Hossein Abbasi
Nano-fertilizers are designed in order to gradually release their food contents. They are also manufactured in such a way that the time of their liberation matches with the food product requirement. The use of nano-fertilizers leads to an increase in the efficiency of the consumption of food elements. With regard to the strategic importance of cotton plant and the effects of zinc in increasing ...
متن کاملSmall-Bias Sets for Nonabelian Groups: Derandomizing the Alon-Roichman Theorem
In analogy with ε-biased sets over Z2 , we construct explicit ε-biased sets over nonabelian finite groups G. That is, we find sets S ⊂ G such that ‖Ex∈S ρ(x)‖ ≤ ε for any nontrivial irreducible representation ρ. Equivalently, such sets make G’s Cayley graph an expander with eigenvalue |λ| ≤ ε. The Alon-Roichman theorem shows that random sets of sizeO(log |G|/ε2) suffice. For groups of the form ...
متن کاملA No - Go Theorem for Derandomized Parallel Repetition
In this work we show a barrier towards proving a randomness-efficient parallel repetition, a promising avenue for achieving many tight inapproximability results. Feige and Kilian (STOC'95) proved an impossibility result for randomnessefficient parallel repetition for two prover games with small degree, i.e., when each prover has only few possibilities for the question of the other prover. In re...
متن کاملBorel circle squaring
We give a completely constructive solution to Tarski’s circle squaring problem. More generally, we prove a Borel version of an equidecomposition theorem due to Laczkovich. If k ≥ 1 and A,B ⊆ Rk are bounded Borel sets with the same positive Lebesgue measure whose boundaries have upper Minkowski dimension less than k, then A and B are equidecomposable by translations using Borel pieces. This answ...
متن کاملSpectral Analysis of Pollard Rho Collisions
We show that the classical Pollard ρ algorithm for discrete logarithms produces a collision in expected time O( √ n(log n)). This is the first nontrivial rigorous estimate for the collision probability for the unaltered Pollard ρ graph, and is close to the conjectured optimal bound of O( √ n). The result is derived by showing that the mixing time for the random walk on this graph is O((log n));...
متن کامل